Stability problem for number-theoretically multiplicative functions
نویسندگان
چکیده
منابع مشابه
On the Mean Value of Nonnegative Multiplicative Number-theoretical Functions
exists . The question of the existence of the mean value M(g) has been much studied, but it has been solved only for certain subclasses . One of the definite results is the following theorem, due to H . Delange [2] (throughout the paper, p denotes a prime, and E and n denote a sum ana a product, respectively, taken over all primes) : p . p If g(n) is a strongly multiplicative number-theoretical...
متن کاملThe number of boolean functions with multiplicative complexity 2
Multiplicative complexity is a complexity measure defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT). Implementations of ciphers with a small number of AND gates are preferred in protocols for fully homomorphic encryption, multi-party computation and zero-knowledge proofs. In 2002, Fischer and Peralta [12] showed that t...
متن کاملSmall points on a multiplicative group and class number problem
Let V be an algebraic subvariety of a torus Gm →֒ P n and denote by V ∗ the complement in V of the Zariski closure of the set of torsion points of V . By a theorem of Zhang, V ∗ is discrete for the metric induced by the normalized height ĥ. We describe some quantitative versions of this result, close to the conjectural bounds, and we discuss some applications to study of the class group of some ...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملArithmetical Functions I: Multiplicative Functions
Truth be told, this definition is a bit embarrassing. It would mean that taking any function from calculus whose domain contains [1,+∞) and restricting it to positive integer values, we get an arithmetical function. For instance, e −3x cos2 x+(17 log(x+1)) is an arithmetical function according to this definition, although it is, at best, dubious whether this function holds any significance in n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2007
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-07-08854-5